On the Spectrum of Lamplighter Groups and Percolation Clusters

نویسندگان

  • FRANZ LEHNER
  • MARKUS NEUHAUSER
چکیده

Let G be a finitely generated group and X its Cayley graph with respect to a finite, symmetric generating set S. Furthermore, let H be a finite group and H ≀G the lamplighter group (wreath product) over G with group of “lamps” H. We show that the spectral measure (Plancherel measure) of any symmetric “switch–walk–switch” random walk on H ≀G coincides with the expected spectral measure (integrated density of states) of the random walk with absorbing boundary on the cluster of the group identity for Bernoulli site percolation on X with parameter p = 1/|H|. The return probabilities of the lamplighter random walk coincide with the expected (annealed) return probabilites on the percolation cluster. In particular, if the clusters of percolation with parameter p are almost surely finite then the spectrum of the lamplighter group is pure point. This generalizes results of Grigorchuk and Żuk, resp. Dicks and Schick regarding the case when G is infinite cyclic. Analogous results relate bond percolation with another lamplighter random walk. In general, the integrated density of states of site (or bond) percolation with arbitrary parameter p is always related with the Plancherel measure of a convolution operator by a signed measure on H ≀ G , where H = Z or another suitable group.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Eigenspaces of Lamplighter Random Walks and Percolation Clusters on Graphs

We show that the Plancherel measure of the lamplighter random walk on a graph coincides with the expected spectral measure of the absorbing random walk on the Bernoulli percolation clusters. In the subcritical regime the spectrum is pure point and we construct a complete set of finitely supported eigenfunctions.

متن کامل

The Speed of Simple Random Walk and Anchored Expansion on Percolation Clusters: an Overview

Benjamini, Lyons and Schramm (1999) considered properties of an infinite graph G, and the simple random walk on it, that are preserved by random perturbations. To address problems raised by those authors, we study simple random walk on the infinite percolation cluster in Cayley graphs of certain amenable groups known as “lamplighter groups”. We prove that zero speed for random walk on a lamplig...

متن کامل

Critical percolation on certain nonunimodular graphs

An important conjecture in percolation theory is that almost surely no infinite cluster exists in critical percolation on any transitive graph for which the critical probability is less than 1. Earlier work has established this for the amenable cases Z and Z for large d, as well as for all non-amenable graphs with unimodular automorphism groups. We show that the conjecture holds for several cla...

متن کامل

Anchored expansion, percolation and speed

Benjamini, Lyons and Schramm [Random Walks and Discrete Potential Theory (1999) 56–84] considered properties of an infinite graph G, and the simple random walk on it, that are preserved by random perturbations. In this paper we solve several problems raised by those authors. The anchored expansion constant is a variant of the Cheeger constant; its positivity implies positive lower speed for the...

متن کامل

THE SCALING LAW FOR THE DISCRETE KINETIC GROWTH PERCOLATION MODEL

The Scaling Law for the Discrete Kinetic Growth Percolation Model The critical exponent of the total number of finite clusters α is calculated directly without using scaling hypothesis both below and above the percolation threshold pc based on a kinetic growth percolation model in two and three dimensions. Simultaneously, we can calculate other critical exponents β and γ, and show that the scal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007